Recursive Modified Pattern Search on High-Dimensional Simplex : A Blackbox Optimization Technique
نویسندگان
چکیده
منابع مشابه
A restarted and modified simplex search for unconstrained optimization
We propose in this paper a simple but efficient modification of the well-known Nelder-Mead (NM) simplex search method for unconstrained optimization. Instead of moving all n simplex vertices at once in the direction of the best vertex, our ”shrink” step moves them in the same direction but one by one until an improvement is obtained. In addition, for solving non-convex problems, we simply resta...
متن کاملSEARCH, Blackbox Optimization, And Sample Complexity
The SEARCH (Search Envisioned As Relation & Class Hierarchizing) framework developed elsewhere (Kargupta, 1995) ooered an alternate perspective toward blackbox optimization (BBO)|optimization in presence of little domain knowledge. The SEARCH framework investigated the conditions essential for transcending the limits of random enumerative search using a framework developed in terms of relations...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملDerivative-free Efficient Global Optimization on High-dimensional Simplex
In this paper, we develop a novel derivative-free deterministic greedy algorithm for global optimization of any objective function of parameters belonging to a unit-simplex. Main principle of the proposed algorithm is making jumps of varying step-sizes within the simplex parameter space and searching for the best direction to move in a greedy manner. Unlike most of the other existing methods of...
متن کاملUnconstrained and Constrained Blackbox Optimization: the Search Perspective
The SEARCH (Search Envisioned As Relation & Class Hierarchizing) framework developed elsewhere (Kargupta, 1995a; Kargupta & Goldberg, 1995) ooered an alternate perspective toward blackbox optimization (BBO)|optimization in presence of little domain knowledge. The SEARCH framework investigates the conditions essential for transcending the limits of random enumerative search using a framework dev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sankhya B
سال: 2020
ISSN: 0976-8386,0976-8394
DOI: 10.1007/s13571-020-00236-9